On the largest and the smallest singular value of sparse rectangular random matrices
نویسندگان
چکیده
We derive estimates for the largest and smallest singular values of sparse rectangular N×n random matrices, assuming limN,n→∞n N=y∈(0,1). consider a model with sparsity parameter pN such that NpN∼logαN some α>1, assume moments matrix elements satisfy condition E|Xjk|4+δ≤C<∞. also entries matrices we are truncated at level (NpN)1 2−ϰ ϰ:=δ 2(4+δ).
منابع مشابه
The Smallest Singular Value of a Random Rectangular Matrix
We prove an optimal estimate on the smallest singular value of a random subgaussian matrix, valid for all fixed dimensions. For an N × n matrix A with independent and identically distributed subgaussian entries, the smallest singular value of A is at least of the order √ N − √ n − 1 with high probability. A sharp estimate on the probability is also obtained.
متن کاملThe Probabilistic Estimates on the Largest and Smallest q-Singular Values of Pre-Gaussian Random Matrices
We study the q-singular values of random matrices with pre-Gaussian entries defined in terms of the `q-quasinorm with 0 < q ≤ 1. Mainly we study the decay of the lower and upper tail probabilities of the largest q-singular value s 1 , when the number of rows of the matrices becomes very large. Furthermore, we also give probabilistic estimates for the smallest q-singular value of pre-Gaussian ra...
متن کاملThe probabilistic estimates on the largest and smallest q-singular values of random matrices
Abstract. We study the q-singular values of random matrices with preGaussian entries defined in terms of the q-quasinorm with 0 < q ≤ 1. In this paper, we mainly consider the decay of the lower and upper tail probabilities of the largest q-singular value s 1 , when the number of rows of the matrices becomes very large. Based on the results in probabilistic estimates on the largest q-singular va...
متن کاملSmallest Singular Value of a Random Rectangular Matrix
We prove an optimal estimate of the smallest singular value of a random subGaussian matrix, valid for all dimensions. For an N n matrix A with independent and identically distributed sub-Gaussian entries, the smallest singular value of A is at least of the order p N pn 1 with high probability. A sharp estimate on the probability is also obtained. © 2009 Wiley Periodicals, Inc.
متن کاملOn generic chaining and the smallest singular value of random matrices with heavy tails
We present a very general chaining method which allows one to control the supremum of the empirical process suph∈H |N−1 ∑N i=1 h (Xi)− Eh2| in rather general situations. We use this method to establish two main results. First, a quantitative (non asymptotic) version of the classical Bai-Yin Theorem on the singular values of a random matrix with i.i.d entries that have heavy tails, and second, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2023
ISSN: ['1083-6489']
DOI: https://doi.org/10.1214/23-ejp919